The integer part of a nonlinear form with integer variables
نویسندگان
چکیده
منابع مشابه
Perspective reformulations of mixed integer nonlinear programs with indicator variables
We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision variables. An indicator variable, when it is “turned off”, forces some of the decision variables to assume fixed values, and, when it is “turned on”, forces them to belong to a convex set. Many practical MINLPs contain integer ...
متن کاملAn extension of the mixed integer part of a nonlinear form
Our aim in this paper is to consider the integer part of a nonlinear form representing primes. We establish that if [Formula: see text] are positive real numbers, at least one of the ratios [Formula: see text] ([Formula: see text]) is irrational, then the integer parts of [Formula: see text] are prime infinitely often for [Formula: see text], where [Formula: see text] are natural numbers.
متن کاملProofs to one inequality conjecture for the non-integer part of a nonlinear differential form
We prove the conjecture for the non-integer part of a nonlinear differential form representing primes presented in (Lai in J. Inequal. Appl. 2015:Article ID 357, 2015) by using Tumura-Clunie type inequalities. Compared with the original proof, the new one is simpler and more easily understood. Similar problems can be treated with the same procedure.
متن کاملOPTIMAL RESOURCE ALLOCATION IN DEA WITH INTEGER VARIABLES
Resource allocation and optimal leveling are among the top challenges in project management. This paper presents a DEA-based procedure for determining an optimal level of inputs to produce a fixed level of outputs. To achieve this goal, we assume that the levels of outputs can be forecasted in the next season and the procedure will determine optimal level of inputs for all DMUs. Such as some of...
متن کاملCutting planes for integer programs with general integer variables
We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 0{1 variables. We also explore the use of Gomory's mixed integer cuts. We address both theoretical and computational issues and show how to embed these cutting planes in a branch-and-bound framew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2015
ISSN: 1029-242X
DOI: 10.1186/s13660-015-0874-2